https://nova.newcastle.edu.au/vital/access/ /manager/Index en-au 5 Probabilistic risk assessment of mine subsidence https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:4608 Wed 11 Apr 2018 16:24:34 AEST ]]> Fitting the 4-parameter lineal basis model https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:12024 i, yi} there is a corresponding "generating" point {Xi, Yi}, which lies on the Lineal Basis. The difference vector between an {Xi, Yi} and its corresponding {xi, yi} is modelled as a sample from a bivariate distribution which here is taken as a product of two independent Beta[α,β] distributions, using the notation Beta[αX, βX]xBeta[αY, βY]. Further, we will allow αX, βX, αY, and βY to vary with s, i.e., we have four functions αX[s, ...], βX[s, ...], αY[s, ...], and βY[s, ...]. Since the mean of the Beta[α, β] distribution is α / (α + β), the parameters of these four function must be such that for a given s, the joint Beta-Beta mean point {αX[s, ...] / (αX[s, ...] + βX[s, ...]), αY[s, ...] / (αY[s, ...] + βY[s, ...]) lies on the Lineal Basis. It turns out that simple linear functions suffice to fit many of the data sets typically encountered in these bounded spaces. Interesting computational issues arise when constructing the "mean prediction region" and the "single prediction region" for a Lineal Basis model, analogous to the "mean prediction bands" and the"single prediction bands" of simple linear regression. Concepts from computational geometry are employed, and in particular the logic of a key calculation is verified via a Manipulate.]]> Wed 11 Apr 2018 10:50:56 AEST ]]> Fenchel-duality and separably-infinite programs https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:14048 Thu 01 May 2014 08:40:14 AEST ]]> Standardization in immunohistology https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:15315 Sat 24 Mar 2018 08:26:36 AEDT ]]> A note on the weighted Khintchine-Groshev Theorem https://nova.newcastle.edu.au/vital/access/ /manager/Repository/uon:18507 n-approximable points in Rmn. The classical Khintchine-Groshev theorem assumes a monotonicity condition on the approximating functions ̲ψ. Removing monotonicity from the Khintchine-Groshev theorem is attributed to different authors for different cases of m and n. It can not be removed for m=n=1 as Duffin-Shcaeffer provided the counter example. We deal with the only remaining case m=2 and thereby remove all unnecessary conditions from the Khintchine-Groshev theorem.]]> Sat 24 Mar 2018 07:51:20 AEDT ]]>